Eigenvalues of Non-Negative Matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small graphs with exactly two non-negative eigenvalues

Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)

متن کامل

On the eigenvalues of some matrices based on vertex degree

The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.

متن کامل

Eigenvalues and Pseudo-eigenvalues of Toeplitz Matrices

The eigenvalues of a nonhermitian Toeplitz matrix A are usually highly sensitive to perturbations, having condition numbers that increase exponentially with the dimension N. An equivalent statement is that the resolvent ( ZZ A)’ of a Toeplitz matrix may be much larger in norm than the eigenvalues alone would suggest-exponentially large as a function of N, even when z is far from the spectrum. B...

متن کامل

On Non-negative-valued Matrices.

cording to our Theorem, if (4) is fulfilled, f3 and a can be so chosen that (2) be fulfilled. This form shows, however, that the lowest term in the determinant Ioua'+ Owa-11, if considered as a polynomial in E, is {nT Hence, the lowest term in the determinant :u ± EWI is I0K-1Iaean-r, i.e., the coefficient of (n7r in the determinant |u + Ew| does not vanish. Conversely, let us assume that u and...

متن کامل

Combinatorial Eigenvalues of Matrices

Let S be a subset of diagonal entries of an n × n complex matrix A. When the members of S have a common value which is equal to an eigenvalue of A, then S is a critical diagonal set of A. The existence of such a set is equivalent to the matrix Ã, obtained from A by setting its diagonal entries equal to zero, having an s × t zero submatrix with s + t ≥ n + 1. If S is a minimal critical diagonal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1964

ISSN: 0003-4851

DOI: 10.1214/aoms/1177700401